PRIMALITY TESTING TECHNIQUES AND THE IMPORTANCE OF PRIME NUMBERS IN SECURITY PROTOCOLS Research Assistant
نویسنده
چکیده
This study presents primality testing by mostly emphasizing on probabilistic primality tests. It is proposed an algorithm for the generation and testing of primes, and explained Carmichael numbers. The importance of prime numbers in encryption is stated and experimental results are given. KeywordsPrime Numbers, Carmichael Numbers, Primality Tests, Prime Generation, Security Protocols, Factorization
منابع مشابه
Fast Generation of Prime Numbers on Portable Devices: An Update
The generation of prime numbers underlies the use of most public-key cryptosystems, essentially as a primitive needed for the creation of RSA key pairs. Surprisingly enough, despite decades of intense mathematical studies on primality testing and an observed progressive intensification of cryptography, prime number generation algorithms remain scarcely investigated and most real-life implementa...
متن کاملAccelerating the Distributed Multiplication Protocol with Applications to the Distributed Miller-Rabin Primality Test
In the light of information security it is highly desirable to avoid a “single point of failure” because this would be an attractive target for attackers. Cryptographic protocols for distributed computations are important techniques in pursuing this goal. An essential module in this context is the secure multiparty multiplication of two polynomially shared values over Zq with a public prime num...
متن کاملEfficient Generation of Prime Numbers
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appearing during various cryptographic setups. Surprisingly, despite decades of intense mathematical studies on primality testing and an observed progressive intensification of cryptographic usages, prime number generation ...
متن کاملPrime Number Generation Based On Pocklington's Theorem
Public-key cryptosystems base their security on well-known number-theoretic problems, such as factorisation of a given number n. Hence, prime number generation is an absolute requirement. Many prime number generation techniques have been proposed up-to-date, which differ mainly in terms of complexity, certainty and speed. Pocklington’s theorem, if implemented, can guarantee the generation of a ...
متن کاملGenerating Provable Primes Efficiently on Embedded Devices
This paper introduces new techniques to generate provable prime numbers efficiently on embedded devices such as smartcards, based on variants of Pocklington’s and the Brillhart-Lehmer-Selfridge-TuckermanWagstaff theorems. We introduce two new generators that, combined with cryptoprocessor-specific optimizations, open the way to efficient and tamper-resistant on-board generation of provable prim...
متن کامل